Two-Agent Slack Due-Date Assignment Scheduling with Resource Allocations and Deteriorating Jobs

In enterprise management, there are often multiple agents competing for the same products to reduce production cost. On this basis, paper investigates a two-agent slack due-date single-machine scheduling problem with deteriorating jobs, where processing time of job is extended as function position-dependent workload, resource allocation and common deterioration rate. The goal find optimal sequence that minimizes maximal value earliness, tardiness, decision variables one agent subject an upper bound on cost second agent. Through theoretical analysis, polynomial algorithm O(N3) proposed problem, N maximum number jobs between two agents.